EQUIVALENCE OF BESOV SPACES ON P.C.F. SELF-SIMILAR SETS
نویسندگان
چکیده
Abstract On post-critically finite self-similar sets, whose walk dimensions of diffusions are in general larger than 2, we find a sharp region where two classes Besov spaces, the heat spaces $B^{p,q}_\sigma (K)$ and Lipschitz–Besov $\Lambda ^{p,q}_\sigma , identical. In particular, provide concrete examples that (K)=\Lambda with $\sigma>1$ . Our method is purely analytical, does not involve kernel estimate.
منابع مشابه
PCF self-similar sets and fractal interpolation
The aim of this paper is to show, using some of Barnsley’s ideas, how it is possible to generalize a fractal interpolation problem to certain post critically finite (PCF) compact sets in R. We use harmonic functions to solve this fractal interpolation problem. © 2013 IMACS. Published by Elsevier B.V. All rights reserved. MSC: 28A78; 58E20
متن کاملEquivalence Conditions for On-diagonal Upper Bounds of Heat Kernels on Self-similar Spaces
We obtain the equivalence conditions for an on-diagonal upper bound of heat kernels on self-similar measure energy spaces. In particular, this upper bound of the heat kernel is equivalent to the discreteness of the spectrum of the generator of the Dirichlet form, and to the global Poincaré inequality. The key ingredient of the proof is to obtain the Nash inequality from the global Poincaré ineq...
متن کاملOn the classification of self-similar sets
We classify binary self-similar sets, which are compact sets determined by two contractions on the plane, into four classes from the viewpoint of functional equations. In this classification, we can not only show close relationships among functions with self-similarity but also give solutions to a few open problems in other field.
متن کاملThe Resolvent Kernel for Pcf Self-similar Fractals
For the Laplacian ∆ defined on a p.c.f. self-similar fractal, we give an explicit formula for the resolvent kernel of the Laplacian with Dirichlet boundary conditions, and also with Neumann boundary conditions. That is, we construct a symmetric function G(λ) which solves (λI − ∆)−1 f (x) = ∫ G(λ)(x, y) f (y) dμ(y). The method is similar to Kigami’s construction of the Green kernel in [Kig01, §3...
متن کاملOn univoque points for self-similar sets
Let K ⊆ R be the unique attractor of an iterated function system. We consider the case where K is an interval and study those elements of K with a unique coding. We prove under mild conditions that the set of points with a unique coding can be identified with a subshift of finite type. As a consequence of this, we can show that the set of points with a unique coding is a graph-directed selfsimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Journal of Mathematics
سال: 2023
ISSN: ['1496-4279', '0008-414X']
DOI: https://doi.org/10.4153/s0008414x23000330